Travelling salesman problem - PDFSEARCH.IO - Document Search Engine

Travelling salesman problem
Results: 321

#	Item
231	The Power of Recourse for Online MST and TSP Nicole Megow1 , Martin Skutella1? , Jos´e Verschae2?? , and Andreas Wiese3? ? ? 1 3 Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 03:19:45 Analysis of algorithms Operations research Spanning tree Online algorithms Minimum spanning tree Amortized analysis Travelling salesman problem Competitive analysis Randomized algorithm Theoretical computer science Computational complexity theory Mathematics
232	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:02 NP-complete problems Spanning tree Operations research Travelling salesman problem Approximation algorithm Time complexity NP-complete Algorithm Minimum spanning tree Theoretical computer science Computational complexity theory Applied mathematics
233	TSP with Bounded Metrics Lars Engebretsen1,? and Marek Karpinski2,?? 1 Department of Numerical Analysis and Computer Science Royal Institute of Technology Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2006-02-09 12:47:04 Complexity classes NP-complete problems Operations research Approximation algorithms Travelling salesman problem Combinatorial optimization APX Optimization problem PCP theorem Theoretical computer science Computational complexity theory Applied mathematics
234	On Approximation Lower Bounds for TSP with Bounded Metrics Marek Karpinski∗ Richard Schmied† Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2012-02-27 08:46:45 Complexity classes NP-complete problems Operations research Travelling salesman problem Approximation algorithm Optimization problem PCP theorem NP-complete APX Theoretical computer science Computational complexity theory Applied mathematics
235	MERLIN A polynomial solution for the Traveling Salesman Problem Dr. Joachim Mertz, [removed] Add to Reading List Source URL: www.merlins-world.de Language: English - Date: 2007-04-13 17:27:56 Complexity classes Operations research Mathematical optimization NP-complete problems Travelling salesman problem NP P versus NP problem Linear programming Combinatorial optimization Theoretical computer science Computational complexity theory Applied mathematics
236	New Inapproximability Bounds for TSP Marek Karpinski∗ Michael Lampis† Richard Schmied‡ Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2013-03-26 06:58:50 Combinatorial optimization NP-complete problems Operations research Travelling salesman problem Matching Graph Cut Connectivity Eulerian path Graph theory Mathematics Theoretical computer science
237	C:/Program Files (x86)/cygwin/home/schmied/Lower Bound TSP SSP'/TECHVER/CATS2013 tech.dvi Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2012-12-14 10:40:44 Complexity classes NP-complete problems Operations research Mathematical optimization Travelling salesman problem Approximation algorithm Optimization problem NP-complete NP Theoretical computer science Computational complexity theory Applied mathematics
238	The Timetable Constrained Distance Minimization Problem Rasmus V. Rasmussen1 and Michael A. Trick2 1 Department of Operations Research, University of Aarhus, Ny Munkegade, Building 1530, 8000 Aarhus C, Denmark Add to Reading List Source URL: mat.gsia.cmu.edu Language: English - Date: 2007-11-25 18:03:30 Theoretical computer science Applied mathematics Linear programming Travelling salesman problem Constraint programming Computational complexity theory Relaxation Constraint Candidate solution Mathematical optimization Operations research Mathematics
239	MATTHIAS GERDTS OPERATIONS RESEARCH SoSe 2009 Address of the Author: Add to Reading List Source URL: www.unibw.de Language: English - Date: 2013-09-30 11:30:30 Operations research Linear programming Travelling salesman problem Assignment problem Combinatorial optimization Simplex algorithm Cutting-plane method Mathematical optimization Nonlinear programming Mathematics Theoretical computer science Applied mathematics
240	SAS Global Forum[removed]Operations Research[removed] Add to Reading List Source URL: support.sas.com Language: English - Date: 2012-04-02 09:13:07 Applied mathematics Operations research Molecular biology Classical genetics DNA Genetic linkage Travelling salesman problem Genetic algorithm Centimorgan Biology Genetics Mathematics

UPDATE